CS G399: Algorithmic Power Tools I Scribe: Jian Wen Lecture Outline:
نویسنده
چکیده
The k-median problem is a variant of the uncapacitated facility location problem that we covered last week, with the difference that instead of a cost for each facility, we have a bound k on the number of facilities. Here is the definition of k-median problem: Problem 1. Given a set of locations(clients) V , a set F̃ of facilities, a cost function between two locations C : (V ⋃ F̃ ) ∗ (V ⋃ F̃ ) → Q+ and an input parameter k, 0 < k ≤ |F̃ |, the k-median problem is to find a subset F ⊆ F̃ and σ : V → F such that
منابع مشابه
CS G 399 : Algorithmic Power Tools I Scribe : Bishal Thapa
In this lecture, we first complete the analysis of “Greedy” approach we introduced in the last lecture, that gives a constant (6)-approximation polynomial-time solution for the Uncapacitated Facility Location problem. Then, we present a primal-dual approach of solving the problem, that yields a better approximation solution of cost within a factor of 3 of the optimal. The latter has a polynomia...
متن کاملCS 7880 : Algorithmic Power Tools Scribe : Eric
As with the tail bounds we saw in the last lecture, Chernoff’s formula is used to bound the probability that a random variable deviates from its mean. For this bound, however, the random variable under consideration will have a very specific structure. Let X1, . . . , Xn be independent {0, 1}-valued random variables, and define pi = Pr[Xi = 1] = E[Xi]. Then, X = ∑ iXi will be the random variabl...
متن کاملCS 7880 : Algorithmic Power Tools Scribe
• Two Simple Applications of the LLL • Packet Routing In this lecture, we prove the general form of the Lovász Local Lemma, and see two applications of the lemma: hypergraph coloring and finding satisfying assignments for Boolean CNF formulas. We then begin studying packet routing, another area in which we will apply the lemma. In the last lecture, we proved the symmetric form of the Lovász Loc...
متن کاملCS 49 : Data Stream Algorithms Lecture Notes , Fall 2011 Amit
Acknowledgements These lecture notes began as rough scribe notes for a Fall 2009 offering of the course " Data Stream Algorithms " at Dartmouth College. The initial scribe notes were prepared mostly by students enrolled in the course in 2009. Subsequently, during a Fall 2011 offering of the course, I edited the notes heavily, bringing them into presentable form, with the aim being to create a r...
متن کاملCS G 399 : Algorithmic Power Tools I Scribe
Where Z∗ is OPT, we know Z∗ = 3x1 + 2x ∗ 2 + 8x ∗ 3, for some x ∗ 1, x ∗ 2, x ∗ 3 ∈ P . By adding two of the inequalities, we arrive at 2x1 + x2 + x3 ≥ 15. Since x1, x2, x3 ≥ 0, we know that Z∗ ≥ 15. But we aren’t limited to addition, multiplication is another way the equations can be combined. So how is this new formulation bouned? This is done by using the dual formulation, D of the minimizat...
متن کامل